Description: 一个关于数据结构的语法匹配，是用栈做的，编程语言是C语言-A matching data on grammatical structure is done with the stack, the programming language is C language Platform: |
Size: 3072 |
Author:员凯 |
Hits:
Description: 以一个m×n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。首先用二维数组存储迷宫数据，迷宫数据由用户输入。一个以链表作存储结构的栈类型，然后编写一个求解迷宫的递归或非递归程序。求得的通路以三元组（i，j，d）形式输出，其中：（i，j）指示迷宫中的一个坐标，d表示走到下一坐标的方向（东、南、西、北四个方向所用代表数字，自行定义） -With an m × n the long square maze, 0 and 1, respectively maze of pathways and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or come to the conclusion there is no path. First of a two-dimensional array to store the data maze, maze data input by the user. A linked list storage structure for stack type, and then write a recursive or non-recursive solving the maze procedure. Obtained access to triples (i, j, d) in the form of output, of which: (i, j) indicates the maze of a coordinate, d represents the coordinates walked next direction (east, south, west, north four directions used on behalf of a digital, self-defined) Platform: |
Size: 3072 |
Author:Ryan |
Hits:
Description: 数据结构的简单应用来实现数制转换，利用链式结构实现栈。-Simple application data structures to achieve number system conversion, the use of chain structure to achieve stack. Platform: |
Size: 1024 |
Author:诚毅韬世 |
Hits:
Description: 以栈模拟停车场，以队列模拟车场外的便道，按照从终端读入数据的序列进行模拟管理。每一组输入数据包括三个数据项：汽车的“到达”（‘A’表示）或“离去”（‘D’表示）信息、汽车标识（牌照号）以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或者便道上的停车位置；若是车辆离去，则输出汽车在停车场停留的时间和应缴纳的费用（便道上停留的时间不收费）。栈以顺序结构实现，队列以链表结构实现。-Parking in the stack simulation to simulate the queue sidewalk outside the car, according to the data read from the terminal sequence simulation management. Each set of input data consists of three data items: car " arrive" (' A' represents) or " left" (' D' indicates) information, auto identification (license number), and the time of arrival or departure. Output information for each set of input data after the operation as follows: If the vehicle arrives, the output car in the parking lot or on a sidewalk parking position If the vehicle leave the car in the parking lot output residence time and should be paid costs (time spent on the sidewalk of charge). Stack structure in order to achieve the queue list structure to achieve. Platform: |
Size: 2048 |
Author:aaaa |
Hits:
Description: 顺序栈和堆栈的实现。
顺序栈被定义为一个结构类型，它有两个域data和top。data为一个一维数组，用于存储栈中元素，DataType为栈元素的数据类型（有待设定）。top为int型，它的取值范围为0..sqstack_maxsize-1。top=0表示栈空，top=sqstack_maxsize-1表示栈满。-Order stacks and stacks of implementation. Is defined as a sequence of stack structure type, which has two fields data and top. data for a one-dimensional array to store the stack elements, DataType is the data type of the stack elements (to be set). top of int type, it ranges 0..sqstack_maxsize-1. top = 0 indicates an empty stack, top = sqstack_maxsize-1 represents the stack is full. Platform: |
Size: 2058240 |
Author:卡卡 |
Hits:
Description: This structure matches the layout of the data saved to the stack following a device-not-present interrupt, part of it saved automatically by the 80386 80486.
Platform: |
Size: 2048 |
Author:loxdyon |
Hits:
Description: 第一个版本的原型机会采用Cortex M3级别的芯片，使用SD卡作为音乐的缓冲区，通过WiFi模块配合
lwIP网络协议栈连接豆瓣服务器，将数据首先下载到SD卡中缓存起来；系统采用一块Vx10xx MP3解码
芯片实现音乐的解码和播放。播放模块始终从SD卡中读取缓存的音乐，从而避免由于网络不稳定带来的
糟糕的播放体验。为了保护该开源项目，SD卡将不使用任何标准的文件系统，我们会将其视作一个巨大
的FLASH缓冲区使用，配合一个简单的链表式存储结构来保存和索引音乐文件。为了解决TCP下载音乐
到SD卡以及从SD进行音乐播放时产生的读写冲突，我们引入了两个SPI Flash作为中间的乒乓双缓冲介质。 该版本使用改进的xmodem协议进行简单的流控制，通过超级终端播放（下载）MP3文件到
系统进行缓冲，并由系统发送到Vx10xx模块。-The first version of the prototype using Cortex M3 level of the chip, using the SD card as a buffer with music, through the WiFi module
LwIP network protocol stack connection bean server, data will be downloaded to the SD card in the first cache the system uses a Vx10xx MP3 decoder
Chip realization of decoding and playing music. Playing module always read cache the music in the SD card, so as to avoid network instability brought
Bad playback experience. In order to protect the open source project, SD card file system will not use any standard, we will regard it as a great
The use of FLASH buffer, with a simple linked list storage structure to store and index the music file. In order to solve the TCP Download Music
To the SD card and the SD to play music is produced when the read-write conflict, we introduce two SPI Flash as the middle of the table tennis double buffer medium. The version of the simple flow control using the improved XMODEM protocol, playing through the super te Platform: |
Size: 1058816 |
Author:大鹏集成 |
Hits:
Description: 通过扩展已实现的基本数据结构，模拟更为复杂的数据结构，是一种常见而实用的技巧。这里，我们将利用栈结构，来模拟一种功能增强的队列。
具体来说，你必须首先实现一个元素类型为int的栈，该栈能且只能支持以下操作接口：
bool empty() //判断是否栈空
void push(int) //向栈中压入一个整数
int pop() //弹出栈顶元素，并返回其数值
int top() //仅获取栈顶元素的值，但不弹出
接下来，你必须借助以上栈结构，模拟所谓的队堆（queap）结构，它至少支持以下操作接口：
void enqueue(int) //新元素作为尾元素入队
int dequeue() //队首元素出队，并返回其数值（调用时输入数据保证队列非空）
int min() //返回队列内的最小元素（调用时输入数据保证队列非空）
可见，这种结构之所以称作队堆，是因为它兼具一定的队列（queue）和堆（heap）的功能。
最后，你还需要通过一系列真实的查询和修改操作，对所实现的队堆结构进行测试。-Expansion has been achieved through a column of basic data structures, simulate more complex data structures, is a common and practical skills. Here, we will use the stack structure to simulate a feature enhanced queue.
Specifically, you must first implement an element of type int stack, the stack can and only supports the following user interface:
bool empty () // determine whether the stack empty
void push (int) // to stack pressed into an integer
int pop () // pop the top element, and returns its value
int top () // get only the value of the stack elements, but does not pop up
Next, you must use the above stack structure, simulate the so-called Team heap (queap) structure, which supports at least the following interfaces:
void enqueue (int) // a new element into the team as the last element
int dequeue () // element of the first team squad, and returns its value (input data to ensure that the queue is not empty when you call)
int min () // Returns the Platform: |
Size: 2048 |
Author:kimhanmiru |
Hits:
Description: 编程实现顺序栈的存储结构与基本算法，主要包括以下功能：
初始化顺序栈S
判断顺序栈S是否为空
依次将字符数据类型的元素’a’,’b’,’c’,’d’,’e’入栈
判断顺序栈S是否为空
依次将顺序栈S栈内的全部元素出栈，并输出出栈结果
判断顺序栈S是否为空
释放并销毁顺序栈S
-Storage structure and basic algorithms programmed sequence stack, including the following features: initialization sequence stack S determine the order whether the stack S is empty sequentially character data type of the element ' a' , ' b' , ' c' , ' d ' ,' e ' stack determine all the elements of the stack S if the sequence is empty sequentially stack order stack S within the stack, the stack and output the results to determine whether the order stack S is empty release order and destroy the stack S Platform: |
Size: 15360 |
Author:郭培鑫 |
Hits:
Description: 编程实现链栈的存储结构与基本算法，主要包括以下功能：
初始化链栈S
判断链栈S是否为空
依次将字符数据类型的元素’a’,’b’,’c’,’d’,’e’入栈
判断链栈S是否为空
依次将链栈S栈内的全部元素出栈，并输出出栈结果
判断链栈S是否为空
释放并销毁链栈S
-Storage structure and basic algorithms programming chain stack, including the following features: whether initialize the link stack S Analyzing link stack S is empty sequentially character data type of the element ' a' , ' b' , ' c' , ' d ' ,' e ' stack Analyzing link stack S is empty successively to all elements within the stack link stack S stack and the stack output judgment results link stack S is empty and destroyed release link stack S Platform: |
Size: 15360 |
Author:郭培鑫 |
Hits:
Description: 通过Astart算法了解对图结构、堆栈、队列、优先级队列等数据结构，并通过回溯过程解决罗马尼亚假日问题。问题内容是通过Astart算法，遍历所有节点（地点），寻找最短路径。-Astart algorithm to understand the structure of the map, stack, queue, priority queue and other data structures, and through the backtracking process to solve the Romanian holiday problem. The problem is through the Astart algorithm, traverse all nodes (places), looking for the shortest path. Platform: |
Size: 193536 |
Author:qjq |
Hits:
Description: 在栈中以结构体形式存入，同时扫描每次存入的数据-In the stack in the form of the structure of the deposit, while scanning the data stored each time
Platform: |
Size: 507904 |
Author:汪伟锋 |
Hits:
Description: 设停车场是一个可停放n辆汽车的下狭长通道，且只有一个大门可供汽车进出，汽车在停车场内按车辆到达的时间先后排序，依次由北向南排列（大门在最南端，最先到达的第一辆车停放在车厂的最北端），若车场内已停满n辆汽车，则后来的汽车只能在门外的便道上等候，一旦有车开走，则排在便道上的第一辆车即可开入；当停车场内某辆车要离开时，在它之后进入的车辆必须先退出车场为它让路，待该车开出大门外，其他车辆再按照原次序进入车场，每辆停放在车场的车在它离开停车场时必须按它停留的时间长短交纳费用。试为停车场编制上述要求的管理模拟程序。(It simulates the parking lot by the stack, simulates the road outside the yard by the queue and simulates it according to the data sequence input from the terminal. Each set of input data includes three data items: the car "reach" or "leave" information, the license number of the car, and the arrival or departure time. The output information on the operation of each set of input data after: if the vehicle arrives, enter the parking position of motor vehicles in the parking lot or sidewalk; if the vehicle arrives, the output of motor vehicles in the parking lot or parking spaces on the sidewalk, if the vehicle left, then the output in the car in the parking lot to stay time and should be pay the costs (no fee stay on the sidewalk). The stack is implemented in a sequential structure, and the queue is implemented by a linked list structure.) Platform: |
Size: 11737088 |
Author:嗨呀哈哈哈
|
Hits:
Description: 任务描述
栈和队列都提供 Push/Pop 两种操作，其中 Push：加入一个元素。Pop：弹出一个元素。给出一个线性结构的进出顺序，判定这个结构是栈还是队列。(40’)
输入描述
第一行输入一个整数s，代表有s组测试数据。
第一行输入一个整数 n，代表操作的次数。
输入 n 行，每行包含两个整数 type val。 当 type = 1时，表示该次操作为 push 操作，val 表示进入的数字。当 type=2 时，表示该次操作为 pop 操作，val 代表出来的数字。
输出描述
对每组测试数据输出一行， 输出该组数据对应的线性结构，若为栈则输出”Stack”，若为队列则输出“Queue”，若两者都是则输出“Both”，若两者都不是则输出“Error”。(Task description
Both stack and queue provide push / pop operations, in which push: adds an element. Pop: pop an element. Give a linear structure in and out order, determine whether the structure is stack or queue.
Enter a description
In the first line, enter an integer s to represent the s set of test data.
For each set of test data, enter an integer n in the first line to represent the number of operations. Then enter n lines, each containing two integers type val. When type = 1, it indicates that the operation is a push operation, and val represents the number entered. When type = 2, it indicates that the operation is a pop operation, and val represents the number.) Platform: |
Size: 1024 |
Author:郝运多多 |
Hits:
Search - data structure stack